Preemptive scheduling and antichain polyhedraQUILLIOT, Alain.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3267-3275, issn 0166-218X, 9 p.Conference Paper

An efficient algorithm for the three-guard problemXUEHOU TAN.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3312-3324, issn 0166-218X, 13 p.Conference Paper

Discrete approximations to real-valued leaf sequencing problems in radiation therapyGUNAWARDENA, Athula; MEYER, Robert R.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3178-3186, issn 0166-218X, 9 p.Conference Paper

On a relation between the domination number and a strongly connected bidirection of an undirected graphLÄTSCH, Martin; PEIS, Britta.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3194-3202, issn 0166-218X, 9 p.Conference Paper

Randomized strategies for the plurality problemKRAL, Daniel; SGALL, Jiri; TICHY, Tomas et al.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3305-3311, issn 0166-218X, 7 p.Conference Paper

Constructions for normal graphs and some consequencesWAGLER, Annegret.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3329-3338, issn 0166-218X, 10 p.Conference Paper

Cologne/Twente Workshop on Graphs and Combinatorial Optimization. CTW 2005FAIGLE, U; RANDERATH, B; SCHRADER, R et al.Discrete applied mathematics. 2008, Vol 156, Num 17, issn 0166-218X, 187 p.Conference Proceedings

Efficiency in exponential time for domination-type problemsSCHIERMEYER, Ingo.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3291-3297, issn 0166-218X, 7 p.Conference Paper

Parameterized algorithmics for linear arrangement problemsFERNAU, Henning.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3166-3177, issn 0166-218X, 12 p.Conference Paper

A clique-difference encoding scheme for labelled k-path graphsPEREIRA, P. R. C; MARKENZON, L; VERNET, O et al.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3216-3222, issn 0166-218X, 7 p.Conference Paper

Counting preimages of TCP reordering patternsHANSSON, Anders; ISTRATE, Gabriel.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3187-3193, issn 0166-218X, 7 p.Conference Paper

Semi-preemptive routing on treesKRUMKE, Sven O; RÄBIGER, Dirk; SCHRADER, Rainer et al.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3298-3304, issn 0166-218X, 7 p.Conference Paper

A new formulation for the Traveling Deliveryman ProblemMENDEZ-DIAZ, Isabel; ZABALA, Paula; LUCENA, Abilio et al.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3223-3237, issn 0166-218X, 15 p.Conference Paper

On the coverings of the d-cube for d ≤ 6EMAMY-K, M. R; ZIEGLER, M.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3156-3165, issn 0166-218X, 10 p.Conference Paper

The connectivity of a graph and its complementHELLWIG, Angelika; VOLKMANN, Lutz.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3325-3328, issn 0166-218X, 4 p.Conference Paper

Approximation algorithms for group prize-collecting and location-routing problemsGLICKSMAN, Hagai; PENN, Michal.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3238-3247, issn 0166-218X, 10 p.Conference Paper

Equivalences and the complete hierarchy of intersection graphs of paths in a treeGOLUMBIC, Martin Charles; LIPSHTEYN, Marina; STERN, Michal et al.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3203-3215, issn 0166-218X, 13 p.Conference Paper

The stack loading and unloading problemMALUCELLI, Federico; PALLOTTINO, Stefano; PRETOLANI, Daniele et al.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3248-3266, issn 0166-218X, 19 p.Conference Paper

Topological sweep of the complete graphRAFALIN, Eynat; SOUVAINE, Diane L.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3276-3290, issn 0166-218X, 15 p.Conference Paper